A self-centralizing characteristic subgroup
نویسندگان
چکیده
منابع مشابه
A Characteristic Subgroup for Fusion Systems
As a counterpart for the prime 2 to Glauberman’s ZJ-theorem, Stellmacher proves that any nontrivial 2-group S has a nontrivial characteristic subgroup W (S) with the following property. For any finite Σ4-free group G, with S a Sylow 2-subgroup of G and with O2(G) self-centralizing, the subgroup W (S) is normal in G. We generalize Stellmacher’s result to fusion systems. A similar construction of...
متن کاملA Characteristic Subgroup and Kernels of Brauer Characters
Note that the intersection property in Theorem A is equivalent to saying that NL(P ) is a p-group. Also, since this property is clearly independent of the choice of P in Sylp(G), it is clear that L is characteristic in G. Our interest in this characteristic subgroup was motivated by the following. Theorem B. Suppose that G is p-solvable and let L be the largest normal subgroup of G such that L∩...
متن کاملCongruence Subgroup Growth of Arithmetic Groups in Positive Characteristic
We prove a new uniform bound for subgroup growth of a Chevalley group G over the local ring F[[t]] and also over local pro-p rings of higher Krull dimension. This is applied to the determination of congruence subgroup growth of arithmetic groups over global fields of positive characteristic. In particular, we show that the subgroup growth of SLn(Fp[t]) (n ≥ 3) is of type nlog n . This was one o...
متن کاملCentralizing information in networks
In the dynamic game we analyze, players are the members of a fixed network. Everyone is initially endowed with an information item that he is the only player to hold. Players are offered a finite number of periods to centralize the initially dispersed items in the hands of any one member of the network. In every period, each agent strategically chooses whether or not to transmit the items he ho...
متن کاملA Note on Witnesses of Centralizing Monoids
We consider multi-variable functions defined over a fixed finite set A. A centralizing monoid M is a set of unary functions on A which commute with all members of some set F of functions on A, where F is called a witness of M . We show that every centralizing monoid has a witness whose arity does not exceed |A|. Then we present a method to count the number of centralizing monoids which have set...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics
سال: 1989
ISSN: 0263-6115
DOI: 10.1017/s1446788700030779